Algorithmic and Analysis Techniques in Property Testing
نویسنده
چکیده
Property testing algorithms are “ultra”-efficient algorithms that decide whether a given object (e.g., a graph) has a certain property (e.g., bipartiteness), or is significantly different from any object that has the property. To this end property testing algorithms are given the ability to perform (local) queries to the input, though the decision they need to make usually concern properties with a global nature. In the last two decades, property testing algorithms have been designed for many types of objects and properties, amongst them, graph properties, algebraic properties, geometric properties, and more. In this article we survey results in property testing, where our emphasis is on common analysis and algorithmic techniques. Among the techniques surveyed are the following: • The self-correcting approach, which was mainly applied in the study of property testing of algebraic properties; • The enforce and test approach, which was applied quite extensively in the analysis of algorithms for testing graph properties (in the dense-graphs model), as well as in other contexts; • Szemerédi’s Regularity Lemma, which plays a very important role in the analysis of algorithms for testing graph properties (in the dense-graphs model); • The approach of Testing by implicit learning, which implies efficient testability of membership in many functions classes. • Algorithmic techniques for testing properties of sparse graphs, which include local search and random walks . ∗This work was supported by the Israel Science Foundation (grant number 246/08).
منابع مشابه
Profiles of covering arrays of strength two
Covering arrays of strength two have been widely studied as combinatorial models of software interaction test suites for pairwise testing. While numerous algorithmic techniques have been developed for the generation of covering arrays with few columns (factors), the construction of covering arrays with many factors and few tests by these techniques is problematic. Random generation techniques c...
متن کاملIranian TEFL Graduates’ Conceptions of Measurement Error in Research: A Genealogical Narrative Inquiry
The aim of this study is to investigate Iranian TEFL graduates’ conception of measurement error in research. Adopting a sequential explanatory multi-method strategy (Borg, 2009), the researchers analyzed causal and temporal relations in the research narratives elicited from 30 TEFL graduates. Gee’s (1986) framework for identifying narrative discourse units (lines, stanzas, and episodes) was ado...
متن کاملExperimental Evaluation of Algorithmic Effort Estimation Models using Projects Clustering
One of the most important aspects of software project management is the estimation of cost and time required for running information system. Therefore, software managers try to carry estimation based on behavior, properties, and project restrictions. Software cost estimation refers to the process of development requirement prediction of software system. Various kinds of effort estimation patter...
متن کاملProjected non-stationary simultaneous iterative methods
In this paper, we study Projected non-stationary Simultaneous It-erative Reconstruction Techniques (P-SIRT). Based on algorithmic op-erators, convergence result are adjusted with Opial’s Theorem. The advantages of P-SIRT are demonstrated on examples taken from to-mographic imaging.
متن کاملRadiation Safety Analysis, 2 Models of Industrial Radiography Techniques in Tubes Testing Using SuperMc 3.2
In this article, we used SuperMc 3.2 Software for have studied two models of welding radiographic techniques that are more common in radiographs (Dobell Walls and Single Image (DWSI) and Single Wall and Single Image (SWSI) technique) , without the use of a collimator and in terms of radiation risk and radiation safety. According to results, Due to the lack of a collimator, the risk of radiation...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Foundations and Trends in Theoretical Computer Science
دوره 5 شماره
صفحات -
تاریخ انتشار 2009